General form of some rational recursive sequences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

General form of some rational recursive sequences

In this note, we study the general form of some rational recursive sequences. By some modification of the methods and ideas, as well as the transformation from the paper [K. The global attractivity of the rational difference equation y n = y n−k +yn−m 1+y n−k yn−m , Appl. Math. Lett. 20 (2007), 54–58], we give a new proof for the conjectures posed therein.

متن کامل

Behavior of a rational recursive sequences

where the initial conditions are arbitrary nonzero real numbers. Recently there has been a great interest in studying the qualitative properties of rational difference equations. For the systematical studies of rational and nonrational difference equations, one can refer to the papers [1-41] and references therein. The study of rational difference equations of order greater than one is quite ch...

متن کامل

RATIONAL CHARACTER TABLE OF SOME FINITE GROUPS

The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational character tables are also considered into account.The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational charact...

متن کامل

On the Rational Recursive Sequence

Our main objective is to study some qualitative behavior of the solutions of the difference equation xn+1 = γxn−k + (axn + bxn−k) / (cxn − dxn−k) , n = 0, 1, 2, ..., where the initial conditions x−k,..., x−1, x0 are arbitrary positive real numbers and the coefficients γ, a, b, c and d are positive constants, while k is a positive integer number.

متن کامل

Recursive Binary Sequences of Differences

A wide variety of problems exist requiring the identification of the best binary sequence from a choice of many. For example, consider the fairest way for “captain A” and “captain B” to choose sides for a pickup game of basketball. It is traditional to alternate choices and if eight other players are available, captain A gets the first, third, fifth, and seventh choices, while captain B gets th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2010

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2009.07.015